New bounds on the density of lattice coverings
نویسندگان
چکیده
We obtain new upper bounds on the minimal density $\Theta _{n, \mathcal {K}}$ of lattice coverings ${\mathbb {R}}^n$ by dilates a convex body $\mathcal {K}$. also probability (with respect to natural Haar-Siegel measure space lattices) that randomly chosen $L$ satisfies $L+\mathcal {K}= {\mathbb {R}}^n$. As step in proof, we utilize and strengthen results discrete Kakeya problem.
منابع مشابه
the effect of traffic density on the accident externality from driving the case study of tehran
در این پژوهش به بررسی اثر افزایش ترافیک بر روی تعداد تصادفات پرداخته شده است. به این منظور 30 تقاطع در شهر تهران بطور تصادفی انتخاب گردید و تعداد تصادفات ماهیانه در این تقاطعات در طول سالهای 89-90 از سازمان کنترل ترافیک شهر تهران استخراج گردید و با استفاده از مدل داده های تابلویی و نرم افزار eviews مدل خطی و درجه دوم تخمین زده شد و در نهایت این نتیجه حاصل شد که تقاطعات پر ترافیک تر تعداد تصادفا...
15 صفحه اولthe effect of creative writing instruction on lexical density of advanced efl learners writing
چکیده ندارد.
15 صفحه اولon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولOn Finite Lattice Coverings
We consider nite lattice coverings of strictly convex bodies K. For planar centrally symmetric K we characterize the nite arrangements Cn such that conv Cn Cn + K, where Cn is a subset of a covering lattice for K (which satisses some natural conditions). We prove that for a xed lattice the optimal arrangement (measured with the parametric density) is either a sausage, a socalled double sausage ...
متن کاملBounds for Optimal Coverings
We give bounds for optimal coverings of finite sets by elements of regular families of subsets, and show that both upper and lower bounds are asymptotically sharp for some families of examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 2021
ISSN: ['0894-0347', '1088-6834']
DOI: https://doi.org/10.1090/jams/984